♯P
SET OF THE COUNTING PROBLEMS ASSOCIATED WITH THE DECISION PROBLEMS IN THE SET NP
Sharp P; Hash-p; Number-P; SharpP; Sharp-P (class); Sharp-P
In computational complexity theory, the complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems associated with the decision problems in the set NP. More formally, #P is the class of function problems of the form "compute f(x)", where f is the number of accepting paths of a nondeterministic Turing machine running in polynomial time.